The 1-D bin packing problem optimisation using bees algorithm

نویسندگان

چکیده

The bin packing problem is a classic combinatorial optimisation that widely used in various applications such as assembly line balancing, scheduling, and time-tabling. Metaheuristic algorithms can provide solutions to these problems faster than exact methods. Bees Algorithm, metaheuristic algorithm inspired by the foraging activity of bees, known for its performance solving problems. To our best knowledge, this first use Algorithm solve problem. In paper, we basic demonstrate near-optimal measure accuracy one-dimensional procedure parameter settings are set following previous research. Benchmark datasets experiment, measured. results indicate research on travelling salesman produce similar results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid genetic approach for 1-D bin packing problem

This paper deals with the one-dimensional Bin Packing Problem (1-D BPP). Exact solution methods can only be used for very small instances, hence for real-world problems we have to focus on heuristic methods. In recent years, researchers have started to apply evolutionary approaches to this problem, including Genetic Algorithms and Evolutionary Programming. In this paper, we propose a Hybrid Gen...

متن کامل

A Hybrid Extremal Optimisation Approach for the Bin Packing Problem

Extremal optimisation (EO) is a simple and effective technique that is influenced by nature and which is especially suitable to solve assignment type problems. EO uses the principle of eliminating the weakest or the least adapted component and replacing it by a random one. This paper presents a new hybrid EO approach that consists of an EO framework with an improved local search for the bin pac...

متن کامل

Evolutionary Algorithm for Bin Packing Problem

In this paper we investigate the use of evolution strategy (ES) for the bin packing problem. We used (1, λ)-ES, where 10 children are generated from one parent by means of a simple genetic operators; the crossover is not applied. The best of the descendants becomes the new parent solution. A widely known ordering representation modified for the purposes of the grouping the objects was used in t...

متن کامل

One-Dimension Multi-Objective Bin Packing Problem using Memetic Algorithm

Abstract— Memetic Algorithm has been proven to be successful to find the nearest optimum solution to hard combinatorial optimization problems. In this paper, Memetic algorithm is designed for One-dimension Multi-Objective Bin Packing Problem. Memetic Algorithm is a combination of power of Genetic algorithm with the powerful local search technique to focus on the population of local optima. In t...

متن کامل

Multi-objective optimisation using the Bees Algorithm

This paper describes the first application of the Bees Algorithm to multi-objective optimisation problems. The Bees Algorithm is a search procedure inspired by the way honey bees forage for food. A standard mechanical design problem, the design of a welded beam structure, was used to benchmark the Bees Algorithm. The results obtained show the robust performance of the Bees Algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal Industrial Servicess

سال: 2022

ISSN: ['2461-0623', '2461-0631']

DOI: https://doi.org/10.36055/jiss.v7i2.14387